Scale reasoning with fuzzy-EL ontologies based on MapReduce
نویسندگان
چکیده
Fuzzy extension of Description Logics (DLs) allows the formal representation and handling of fuzzy or vague knowledge. In this paper, we consider the problem of reasoning with fuzzy-EL, which is a fuzzy extension of EL+. We first identify the challenges and present revised completion classification rules for fuzzy-EL that can be handled by MapReduce programs. We then propose an algorithm for scale reasoning with fuzzy-EL ontologies using MapReduce. Some preliminary experimental results are provided to show the scalability of our algorithm.
منابع مشابه
Reasoning with Fuzzy-EL+ Ontologies Using MapReduce
Fuzzy extension of Description Logics (DLs) allows the formal representation and handling of fuzzy knowledge. In this paper, we consider fuzzy-EL, which is a fuzzy extension of EL. We first present revised completion rules for fuzzy-EL that can be handled by MapReduce programs. We then propose an algorithm for scale reasoning with fuzzy-EL ontologies based on MapReduce.
متن کاملLarge Scale Fuzzy pD * Reasoning Using MapReduce
The MapReduce framework has proved to be very efficient for data-intensive tasks. Earlier work has tried to use MapReduce for large scale reasoning for pD∗ semantics and has shown promising results. In this paper, we move a step forward to consider scalable reasoning on top of semantic data under fuzzy pD∗ semantics (i.e., an extension of OWL pD∗ semantics with fuzzy vagueness). To the best of ...
متن کاملA MapReduce Algorithm for EL+
Recently, the use of the MapReduce framework for distributed RDF Schema reasoning has shown that it is possible to compute the deductive closure of sets of over a billion RDF triples within a reasonable time span [22], and that it is also possible to carry the approach over to OWL Horst [21]. Following this lead, in this paper we provide a MapReduce algorithm for the description logic EL+, more...
متن کاملDistributed Reasoning with EL using MapReduce
It has recently been shown that the MapReduce framework for distributed computation can be used effectively for large-scale RDF Schema reasoning, computing the deductive closure of over a billion RDF triples within a reasonable time [23]. Later work has carried this approach over to OWL Horst [22]. In this paper, we provide a MapReduce algorithm for classifying knowledge bases in the descriptio...
متن کاملReasoning with Large A-Boxes in Fuzzy Description Logics using DL reasoners: An experimental evaluation
While knowledge representation languages developed in the context of the Semantic Web build mainly on crisp knowledge, fuzzy reasoning seems to be needed for many applications, e.g. for retrieval of images or other resources. However, techniques for fuzzy reasoning need to scale to large A-Boxes for practical applications. As a first step towards clarifying whether fuzzy reasoning techniques ca...
متن کامل